A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
نویسندگان
چکیده
Article history: Received 30 March 2014 Accepted 7 November 2014 Available online 13 November 2014 Communicated by G. Ausiello
منابع مشابه
Shortest Unique Queries on Strings
Let D be a long input string of n characters (from an alphabet of size up to 2 , wherew is the number of bits in a machine word). Given a substring q of D, a shortest unique query returns a shortest unique substring of D that contains q. We present an optimal structure that consumes O(n) space, can be built in O(n) time, and answers a query in O(1) time. We also extend our techniques to solve s...
متن کاملShortest Unique Substring Queries on Run-Length Encoded Strings
We consider the problem of answering shortest unique substring (SUS) queries on run-length encoded strings. For a string S, a unique substring u = S[i..j] is said to be a shortest unique substring (SUS) of S containing an interval [s, t] (i ≤ s ≤ t ≤ j) if for any i′ ≤ s ≤ t ≤ j′ with j − i > j′ − i′, S[i′..j′] occurs at least twice in S. Given a run-length encoding of size m of a string of len...
متن کاملبهبود الگوریتم انتخاب دید در پایگاه داده تحلیلی با استفاده از یافتن پرس وجوهای پرتکرار
A data warehouse is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing frequent queries. Previously posed ...
متن کاملShortest unique palindromic substring queries in optimal time
A palindrome is a string that reads the same forward and backward. A palindromic substring P of a string S is called a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if P occurs exactly once in S, this occurrence of P contains interval [s, t], and every palindromic substring of S which contains interval [s, t] and is shorter than P occurs at least twice in S. The SUPS...
متن کاملاستفاده از الگوریتم ژنتیک در مسائل کوتاهترین مسیر چند معیاره بر پایه سیستمهای اطلاعات مکانی
Multi-criteria shortest path problems (MSPP) are called as NP-Hard. For MSPPs, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. Algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. This paper describes the development ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 562 شماره
صفحات -
تاریخ انتشار 2015